7 Summary

The paper proposes a parallel algorithm to compute the eigenvalues and eigenvectors of a real symmetric matrix on a mesh multicomputer. The algorithm uses the one-sided Jacobi method and it is aimed at reducing the communication cost incurred by one-dimensional algorithms found in the literature. The performance of the proposed algorithm on a squared 2D/3D mesh multicomputer is assessed through simple analytical models of execution time. The models show that the performance improvement over one-dimensional algorithms can be very noticeable, specially for a large number of nodes.